A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
نویسندگان
چکیده
منابع مشابه
Linear Time Algorithms for Generalized Edge Dominating Set Problems
We prove that a generalization of the edge dominating set problem, in which each edge e needs to be covered be times for all e ∈ E, admits a linear time 2-approximation for general unweighted graphs and that it can be solved optimally for weighted trees. We show how to solve it optimally in linear time for unweighted trees and for weighted trees in which be ∈ {0, 1} for all e ∈ E. Moreover, we ...
متن کاملEdge-Dominating Set Problem
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...
متن کاملOn Approximation Complexity of Edge Dominating Set Problem in Dense Graphs
We study the approximation complexity of the Minimum Edge Dominating Set problem in everywhere ǫ-dense and average ǭ-dense graphs. More precisely, we consider the computational complexity of approximating a generalization of the Minimum Edge Dominating Set problem, the so called Minimum Subset Edge Dominating Set problem. As a direct result, we obtain for the special case of the Minimum Edge Do...
متن کاملOn Approximability of the Independent/Connected Edge Dominating Set Problems
We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...
متن کاملOn connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper first proposes a constant-ratio...
متن کامل